Learning Abductive Inference by Analogy in ACT-R
نویسنده
چکیده
The question investigated in this paper is: How does ACT-R propitiate as an architecture for modeling the search and evaluation of (scientific) hypotheses? It is demonstrated how inductive search, modeled by Paul Thagard's PI and Herbert Simon's BACON.1, can easily be learned from examples by ACT-R 3.0 as a form of abductive inference. Furthermore, I argue that PI's hypothesis evaluation process 'inference to the best explanation' is subsumed by ACT-R's rational analysis mechanism.
منابع مشابه
Learning Abductive Search by Analogy in ACT-R
The general question investigated in this paper is: How can the cognitive architecture of John Anderson's ACT-R theory of the mind be used for modeling the search and evaluation of (scientific) hypotheses? It is demonstrated how inductive search, modeled by Paul Thagard's PI and Herbert Simon's BACON, can both be learned from examples by ACT-R as a form of abductive search. Furthermore, I argue...
متن کاملAn Inference-based Framework for Multistrategy Learning
This chapter describes a general framework for multistrategy learning. One idea of this framework is to view learning as an inference process and to integrate the elementary inferences that are employed by the single-strategy learning methods. Another idea is to base learning on building and generalizing a special type of explanation structure called plausible justification tree which is compos...
متن کاملTOWARD A UNIFIED THEORY OF LEARNING: Basic Ideas and a Classification of Learning Processes
The paper presents initial results toward developing a unifying conceptual framework for characterizing diverse learning strategies and paradigms. It outlines the inferential learning theory (lLn that aims at understanding the competence aspects of learning processes. Thus, the theory has different goals than computational learning theory that is concerned with computational complexity of learn...
متن کاملComputing as Compression by Multiple Alignment, Unification and Search (2) J
This article continues the presentation, begun in the accompanying article,16) of the proposal that computing in some deep sense may be understood as a process of information compression by multiple alignment, unification and metrics-guided search. Examples are presented and discussed to show how this framework of ideas may be applied to such things as pattern recognition, information retrieval...
متن کاملLearning Inference by Induction
This paper studies learning inference by induction. We first consider the problem of learning logical inference rules. Given a set S of propositional formulas and their logical consequences T , the goal is to find deductive inference rules that produce T from S. We show that an induction algorithm LF1T, which learns logic programs from interpretation transitions, successfully produces deductive...
متن کامل